GPU-Based Parallel Particle Swarm Optimization Methods for Graph Drawing
نویسندگان
چکیده
منابع مشابه
Accelerating parallel particle swarm optimization via GPU
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...
متن کاملGPU-Based Parallel Multi-objective Particle Swarm Optimization
In the recent years, multi-objective particle swarm optimization (MOPSO) has become quite popular in the field of multi-objective optimization. However, due to a large amount of fitness evaluations as well as the task of archive maintaining, the running time of MOPSO for optimizing some difficult problems may be quite long. This paper proposes a parallel MOPSO based on consumer-level Graphics P...
متن کاملGPU-Based Asynchronous Global Optimization with Particle Swarm
The recent upsurge in research into general-purpose applications for graphics processing units (GPUs) has made low cost high-performance computing increasingly more accessible. Many global optimization algorithms that have previously benefited from parallel computation are now poised to take advantage of general-purpose GPU computing as well. In this paper, a global parallel asynchronous partic...
متن کاملParallel asynchronous particle swarm optimization.
The high computational cost of complex engineering optimization problems has motivated the development of parallel optimization algorithms. A recent example is the parallel particle swarm optimization (PSO) algorithm, which is valuable due to its global search capabilities. Unfortunately, because existing parallel implementations are synchronous (PSPSO), they do not make efficient use of comput...
متن کاملDevelopment of Particle Swarm Optimization Based Algorithm for Graph Partitioning
From the review, it is studied that the min cut k – partitioning problem is a fundamental partitioning problem and is NP hard also. Most of the existing partitioning algorithms are heuristic in nature and they try to find a reasonably good solution. These algorithms falls in move – based category in which solution is generated iteratively from an initial solution applying move to the recent sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2017
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2017/2013673